On the cardinality constrained matroid polytope
نویسندگان
چکیده
منابع مشابه
On the cardinality constrained matroid polytope
Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...
متن کاملValuations for matroid polytope subdivisions
We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.
متن کاملCardinality Constrained Portfolio Optimisation
The traditional quadratic programming approach to portfolio optimisation is difficult to implement when there are cardinality constraints. Recent approaches to resolving this have used heuristic algorithms to search for points on the cardinality constrained frontier. However, these can be computationally expensive when the practitioner does not know a priori exactly how many assets they may des...
متن کاملTrioid: A generalization of matroid and the associated polytope
Abstract. We consider a generalization of the well known greedy algorithm, called mstep greedy algorithm, where m elements are examined in each iteration. When m = 1 or 2, the algorithm reduces to the standard greedy algorithm. For m = 3 we provide a complete characterization of the independence system, called trioid, where the m-step greedy algorithm guarantees an optimal solution for all weig...
متن کاملThe Lattice of Flats and its Underlying Flag Matroid Polytope
Let M be a matroid and F the collection of all linear orderings of bases ofM. orflags of M. We define the flag matroid polytope A(F)We determine when two vertices of A(F) are adjacent, and provide a bijection between maximal chains in the lattice of flats of M and certain maximal faces of A(F).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2011
ISSN: 0028-3045
DOI: 10.1002/net.20430